Extremal optimization: heuristics via coevolutionary avalanches
نویسندگان
چکیده
منابع مشابه
Extremal optimization: heuristics via coevolutionary avalanches
gates on a single integrated circuit, so you have to partition the gates between separate circuits. Let's assume that you are forced to place exactly n/2 gates each on two integrated circuits. The connections between the gates across the partition are slow, energy consuming, and heat producing, while the cost associated with connections inside an integrated circuit are negligible. So, you want ...
متن کاملConvex Separation from Optimization via Heuristics
Let K be a full-dimensional convex subset of Rn. We describe a new polynomialtime Turing reduction from the weak separation problem for K to the weak optimization problem for K that is based on a geometric heuristic. We compare our reduction, which relies on analytic centers, with the standard, more general reduction.
متن کاملExtremal Optimization
We explore a new general-purpose heuristic for finding high-quality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent complexity in physical systems. Extremal optimization successively replaces extremely undesirable elements of a single sub-optimal solution with new, random ones...
متن کاملFunction Optimization with Coevolutionary Algorithms
The problem of parallel and distributed function optimization with coevolutionary algorithms is considered. Two coevolutionary algorithms are used for this purpose and compared with sequential genetic algorithm (GA). The first coevolutionary algorithm called a loosely coupled genetic algorithm (LCGA) represents a competitive coevolutionary approach to problem solving and is compared with anothe...
متن کاملAdaptive Niching Via Coevolutionary Sharing
An adaptive niching scheme called coevolutionary shared niching (CSN) is proposed, implemented, analyzed and tested. The scheme overcomes the limitations of xed sharing schemes by permitting the locations and radii of niches to adapt to complex landscapes, thereby permitting a better distribution of solutions in problems with many badly spaced optima. The scheme takes its inspiration from the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing in Science & Engineering
سال: 2000
ISSN: 1521-9615
DOI: 10.1109/5992.881710